A parallel algorithm for incremental stereo matching on SIMD machines
نویسندگان
چکیده
Previous matching algorithms have achieved high speeds through algorithm simplification and/or relied on custom hardware. The objective of our work has been the development a robust high-speed stereo matcher by exploiting parallel algorithms executing on general purpose SIMD machines. Our approach is based on several existing techniques dealing with the classification and evaluation of matches, the application of ordering constraints, and relaxation-based matching. The techniques have been integrated and reformulated in terms of parallel execution on the theoretical SIMD machine. Feasibility is demonstrated by implementation on a commercially available SIMD machine. Its performance is compared with that of the idealized machine.
منابع مشابه
High - Speed Stereo Matching with Wavelet Frame Representations
This paper introduces a novel approach for accomplishing stereo matching by overcomplete multiresolution representations. We show that efficient representations can be identified within a continuum of scale space provided by wavelet frames. Local maxima coefficients extracted from wavelet frame spaces are translation invariant through scale space, and provide a stable and complete representatio...
متن کاملA PC-based Real-Time Stereo Vision System
This paper describes a stereo vision system that enables real-time dense depth measurements on a personal computer. The system relies on a very efficient stereo matching engine that, unlike many other approaches which use two distinct matching phases in order to detect unreliable matches, uses a single matching phase. Our matching engine allows for rejecting most unreliable matches by exploitin...
متن کاملA Parallel Algorithm for Graph Matching and Its MasPar Implementation
Search of discrete spaces is important in combinatorial optimization. Such problems arise in artificial intelligence, computer vision, operations research, and other areas. For realistic problems, the search spaces to be processed are usually huge, necessitating long computation times, pruning heuristics, or massively parallel processing. We present an algorithm that reduces the computation tim...
متن کاملSolving the Problem of Scheduling Unrelated Parallel Machines with Limited Access to Jobs
Nowadays, by successful application of on time production concept in other concepts like production management and storage, the need to complete the processing of jobs in their delivery time is considered a key issue in industrial environments. Unrelated parallel machines scheduling is a general mood of classic problems of parallel machines. In some of the applications of unrelated parallel mac...
متن کاملParallel Generation of t-ary Trees
A parallel algorithm for generating t-ary tree sequences in reverse B-order is presented. The algorithm generates t-ary trees by 0-1 sequences, and each 0-1 sequences is generated in constant average time O(1). The algorithm is executed on a CREW SM SIMD model, and is adaptive and cost-optimal. Prior to the discussion of the parallel algorithm a new sequential generation with O(1) average time ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Robotics and Automation
دوره 7 شماره
صفحات -
تاریخ انتشار 1991